منابع مشابه
Characteristica Universalis *
Yores hensigt vil her va::re at konstruere dele af et direkte afbildende sprog, som vil sa::tte os i stand til at repra::sentere virkelighedens mest generelle strukturer. Vi skal ikke her benytte os af de logiske standard-behandlinger af epistemiske tilstande, der sa::dvanligvis opfatter disse som domme (propositioner). Vi vil i stedet genoptage den ikke mindre a::rva::rdige, men nutildags noge...
متن کاملWind Simulation for Extreme and Fatigue Loads
Målinger af atmosfærisk turbulens afviger fra en Gaussisk proces, specielt hvad ang̊ar hastighedsændringer over sm̊a tidsskridt, hvor halerne p̊a sandsynlighedsfordelingen snarere er ekspotentielle end Gaussiske. Tælleprincipperne for ekstreme hændelser og eksistensen af kaskader af hændelser gennemg̊as. Empiriske ekstremstatistikker findes i overensstemmelse med Rices overskridelsesteori, n̊ar ford...
متن کاملInvestigating small scale combat situations in real time strategy computer games
This thesis presents and analyses the problem of small scale combat (SSC) in real time strategy (RTS) computer games. An RTS game is a war simulator where several opposing factions battle in a virtual world. The problem of SSC appears when soldiers, called units, of opposing factions meet in this virtual world. In commercial RTS games SSC situations are handled by applying simple rules to each ...
متن کاملThe VIL (Virtual Immersive Learning) test-bed
The Virtual Immersive Learning (VIL) test-bed implements a virtual collaborative immersive environment, capable of integrating natural contexts and typical gestures, which may occur during traditional lectures, enhanced with advanced experimental sessions. The main aim of the paper is to describe the test-bed motivations, as well as the most significant choices, both hardware and software, adop...
متن کاملFrequent Itemsets Mining with VIL - Tree Algorithm
The aim of this paper is to develop a new mining algorithm to mine all frequent itemsets from a transaction database called the vertical index list (VIL) tree algorithm. The main advantages of the previous algorithms, which are frequent pattern (FP) growth and inverted index structure (IIS) mine, are still useful in a new approach as database scanning only done once, and all frequent itemsets a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tidsskrift for Den norske legeforening
سال: 2015
ISSN: 0029-2001
DOI: 10.4045/tidsskr.15.0095